Highly edge-connected regular graphs without large factorizable subgraphs

We construct highly edge-connected $r$-regular graphs of even order which do not contain $r?2$ pairwise disjoint perfect matchings. When $r$ is a multiple of 4, the result solves a problem of Thomassen [4].     

There is no (95, 40, 12, 20) strongly regular graph

We show that there is no (95, 40, 12, 20) strongly regular graph and, consequently, there is no (96, 45, 24, 18) strongly regular graph, no nontrivial regular two‐graph on 96 vertices, and no partial geometry pg(4, 9, 2). The main idea of the result is based on the star complement technique and requires a moderate amount of computation.     

Quasi-symmetric 2-(64,24,46) designs derived from AG(3,4)

This paper completes the enumeration of quasi-symmetric 2-$(64,24,46)$ designs supported by the dual code $C^{\perp }$ of the binary linear code $C$ spanned by the lines of $AG(3,4)$, initiated in Rodrigues and Tonchev (2015). It is shown that $C^{\perp }$ supports exactly 30,264 nonisomorphic quasi-symmetric 2-$(64,24,46)$ designs. The automorphism groups of the related strongly regular graphs are computed.     

Applications of ‐invariant distributions

In this sequel to the article 17 , a criterion for the regularity of fundamental solutions of differential operators with positive symbol is proved in analogy to Hörmander's criteria, see 9 , 12 . It implies that the temperate fundamental solution of the operator is not regular. Furthermore, a formula for the convolution of two ‐invariant distributions is presented, and, finally, L. Schwartz' question on the surjectivity of linear partial differential operators with constant coefficients on the space is completely answered in the case of ‐invariant differential operators.     

Weak π-rings

In this paper we establish some characterizations for weak π-rings.